Message-Passing Methods for Complex Contagions

نویسندگان

  • James P. Gleeson
  • Mason A. Porter
چکیده

Message-passing methods provide a powerful approach for calculating the expected size of cascades either on random networks (e.g., drawn from a configuration-model ensemble or its generalizations) asymptotically as the number N of nodes becomes infinite or on specific finite-size networks. We review the message-passing approach and show how to derive it for configurationmodel networks using the methods of [1–3]. Using this approach, we explain for such networks how to determine an analytical expression for a “cascade condition”, which determines whether a global cascade will occur. We extend this approach to the message-passing methods for specific finite-size networks, and we derive a generalized cascade condition. Throughout this chapter, we illustrate these ideas using the Watts threshold model.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complex Contagions Models in Opportunistic Mobile Social Networks

Information contagions is one of the key applications in opportunistic mobile social networks (OMSNs). Most of the recent work only considers the simple contagions, in which the “infected” node will infect each of its opinion-free neighbors through simple contact. However, when the behaviors, beliefs, or preferences spread through the social contact, the willingness to participate may require i...

متن کامل

Blocking Complex Contagions Using Community Structure

Blocking the propagation of contagions in populations has many applications, such as stopping the dissemination of leaked information and impeding the spread of an ideology or opinion. Several methods exist for blocking contagions by removing key or critical nodes from a network representation of a population. Some methods, based on network topology alone, run very fast, but their performance c...

متن کامل

An Operator Interpretation of Message Passing

Message passing algorithms may be viewed from a purely probabilistic or statistical physics perspective. This works describes an alternative, linear algebraic view of message passing in trees. We demonstrate the construction of global belief operators on Markov Chains and Trees and compare these with classical results. By interpreting message passing as finding a global stable solution we wish ...

متن کامل

Complex Contagions: A Decade in Review

Since the publication of “Complex Contagions and the Weakness of Long Ties” in 2007, complex contagions have been studied across an enormous variety of social domains. In reviewing this decade of research, we discuss recent advancements in applied studies of complex contagions, particularly in the domains of health, innovation diffusion, social media, and politics. We also discuss how these emp...

متن کامل

Complex Contagion and the Weakness of Long Ties

The strength of weak ties is that they tend to be long – they connect socially distant locations. Recent research on “small worlds” shows that remarkably few long ties are needed to give large and highly clustered populations the “degrees of separation” of a random network, in which information can rapidly diffuse. We test whether this effect of long ties generalizes from simple to complex cont...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1703.08046  شماره 

صفحات  -

تاریخ انتشار 2017